Incentive Compatibility in Stochastic Dynamic Systems
نویسندگان
چکیده
منابع مشابه
Dynamic Price Sequence and Incentive Compatibility
We introduce and study a new auction model in which a certain type of goods is offered over a period of time, and buyers arrive at different times and stay until a common deadline (unless their purchase requests have been fulfilled). We examine in this model incentive compatible auction protocols (i.e., those that induce participants to bid their true valuations). We establish an interesting co...
متن کاملQuantifying Incentive Compatibility of Ranking Systems
Reasoning about agent preferences on a set of alternatives, and the aggregation of such preferences into some social ranking is a fundamental issue in reasoning about multi-agent systems. When the set of agents and the set of alternatives coincide, we get the ranking systems setting. A famous type of ranking systems are page ranking systems in the context of search engines. Such ranking systems...
متن کاملInformativeness and Incentive Compatibility for Reputation Systems
Reputation systems, which rank agents based on feedback from past interactions, play a crucial role in aggregating and sharing trust information online. Reputation systems are used to find authoritative web sites and ensure socially beneficial behavior on auction sites. The main problem faced by reputation system researchers is a lack of good metrics for comparison and evaluation. This thesis d...
متن کاملExpressiveness and Optimization under Incentive Compatibility Constraints in Dynamic Auctions
This thesis designs and analyzes auctions for persistent goods in three domains with arriving and departing bidders, quantifying tradeoffs between design objectives. The central objective is incentive compatibility, ensuring that it is in bidders’ best interest to reveal their private information truthfully. Other primary concerns are expressiveness, i.e. the richness of the effective bidding l...
متن کاملMonotonicity and Incentive Compatibility
Understanding multi-dimensional mechanism design. 1 The Model Let M = {1, . . . , m} be a finite set of agents. Every agent has private information, which can be multi-dimensional. This is called his type. The space from which an agent draws his type is called his type space. Let Ti denote the type space of agent i ∈ M . We assume Ti ⊆ R n for some integer n ≥ 1. Let T m = ×mi=1Ti. Also, denote...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2021
ISSN: 0018-9286,1558-2523,2334-3303
DOI: 10.1109/tac.2020.2987802